A Max Metric to Evaluate a Cluster

نویسندگان

  • Hosein Alizadeh
  • Hamid Parvin
  • Sajad Parvin
  • Zahra Rezaei
  • Moslem Mohamadi
چکیده

In this paper a new criterion for clusters validation is proposed. This new cluster validation criterion is used to approximate the goodness of a cluster. The clusters which satisfy a threshold of the proposed measure are selected to participate in clustering ensemble. To combine the chosen clusters, some methods are employed as aggregators. Employing this new cluster validation criterion, the obtained ensemble is evaluated on some well-known and standard datasets. The empirical studies show promising results for the ensemble obtained using the proposed criterion comparing with the ensemble obtained using the standard clusters validation criterion. Besides to reach the best results, the method gives an algorithm based on which one can find how to select the best subset of clusters from a pool of clusters.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Structure of Metric-like Spaces

The main purpose of this paper is to introduce several concepts of the metric-like spaces. For instance, we define concepts such as equal-like points, cluster points and completely separate points. Furthermore, this paper is an attempt to present compatibility definitions for the distance between a point and a subset of a metric-like space and also for the distance between two subsets of a metr...

متن کامل

Indicator of $S$-Hausdorff metric spaces and coupled strong fixed point theorems for pairwise contraction maps

In the study of fixed points of an operator it is useful to consider a more general concept, namely coupled fixed point. Edit In this paper, by using notion partial metric, we introduce a metric space $S$-Hausdorff on the set of all close and bounded subset of $X$. Then the fixed point results of multivalued continuous and surjective mappings are presented. Furthermore, we give a positive resul...

متن کامل

Composite Kernel Optimization in Semi-Supervised Metric

Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...

متن کامل

Fairness comparison of FAST TCP and TCP Reno

In networking, it is often required to quantify by how much one protocol is fairer than another and how certain parameter setting and/or protocol enhancements improve fairness. This paper provides a framework to evaluate the fairness of various protocols in a general telecommunications network. Within this framework, there are two key components: (1) a benchmark and (2) a single dimension metri...

متن کامل

Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms

The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the UFLP using probabilistic inference in a graphical model an approach that has received little attention in the past. We show that the fixed points of max-product linear programming (MPLP), a convexified version of the ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012